Extreme Points of Polar Convex Sets
نویسنده
چکیده
منابع مشابه
C*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings
Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...
متن کاملConvexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملExtreme Points of the Credal Sets Generated by Elementary Comparative Probabilities
When using convex probability sets (or, equivalently, lower previsions) as models of uncertainty, identifying extreme points can be useful to perform various computations or to use some algorithms. In general, sets induced by specific models such as possibility distributions, linear vacuous mixture or 2-monotone measures may have extreme points easier to compute than generic convex sets. In thi...
متن کاملA Straightforward Preprocessing Approach for Accelerating Convex Hull Computations on the GPU
An effective strategy for accelerating the calculation of convex hulls for point sets is to filter the input points by discarding interior points. In this paper, we present such a straightforward and efficient preprocessing approach by exploiting the GPU. The basic idea behind our approach is to discard the points that locate inside a convex polygon formed by 16 extreme points. Due to the fact ...
متن کاملSkeleton Redundancy Reduction Based on a Generalization of Convexity
We present a generalization of the concept of Convex Sets, based on the Morphological Closing operation, and study some of its properties. We also deene Extreme Points of such Generalized Convex Sets, which generalize the notion of Extreme Points of Convex Sets. Moreover, we apply the above notions to skeleton redundancy removal, and present an algorithm for obtaining an Error-Free Skeleton rep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010